Towards Robustness in Parsing - Fuzzifying Context-Free Language Recognition
نویسنده
چکیده
− We discuss the concept of robustness with respect to parsing a context-free language. Our approach is based on the notions of fuzzy language, (generalized) fuzzy context-free grammar and parser / recognizer for fuzzy languages. As concrete examples we consider a robust version of Cocke−Younger−Kasami’s algorithm and a robust kind of recursive descent recognizer.
منابع مشابه
Parsing Non-Recursive Context-Free Grammars
We consider the problem of parsing non-recursive context-free grammars, i.e., context-free grammars that generate finite languages. In natural language processing, this problem arises in several areas of application, including natural language generation, speech recognition and machine translation. We present two tabular algorithms for parsing of non-recursive context-free grammars, and show th...
متن کاملParsing non-recursive CFGs
We consider the problem of parsing non-recursive context-free grammars, i.e., context-free grammars that generate finite languages. In natural language processing, this problem arises in several areas of application, including natural language generation, speech recognition and machine translation. We present two tabular algorithms for parsing of non-recursive context-free grammars, and show th...
متن کاملTabular Parsing
Parsing is the process of determining the parses of an input string according to a grammar. In this chapter we will restrict ourselves to context-free grammars. Parsing is related to recognition, which is the process of determining whether an input string is in the language described by a grammar or automaton. Most algorithms we will discuss are recognition algorithms, but since they can be str...
متن کاملتأثیر ساختواژهها در تجزیه وابستگی زبان فارسی
Data-driven systems can be adapted to different languages and domains easily. Using this trend in dependency parsing was lead to introduce data-driven approaches. Existence of appreciate corpora that contain sentences and theirs associated dependency trees are the only pre-requirement in data-driven approaches. Despite obtaining high accurate results for dependency parsing task in English langu...
متن کامل